An Evolutionary Algorithm to Track Changes of Optimum Value Locations in Dynamic Environments
نویسندگان
چکیده
1 The LIDIC is supported by the Universidad Nacional de San Luis and the ANPCYT (National Agency to Promote Science and Technology). ABSTRACT Non–stationary, or dynamic, problems change over time. There exist a variety of forms of dynamism. The concept of dynamic environments in the context of this paper means that the fitness landscape changes during the run of an evolutionary algorithm. Genetic diversity is crucial to provide the necessary adaptability of the algorithm to changes. Two mechanism of macromutation are incorporated to the algorithm to maintain genetic diversity in the population. The algorithm was tested on a set of dynamic testing functions provided by a dynamic fitness problem generator. The main goal was to determinate the algorithm’s ability to reacting to changes of optimum values that alter their locations, so that the optimum value can still be tracked when dimensional and multimodal scalability in the functions is adjusted. The effectiveness and limitations of the proposed algorithm is discussed from results empirically obtained.
منابع مشابه
Optimization in Uncertain and Complex Dynamic Environments with Evolutionary Methods
In the real world, many of the optimization issues are dynamic, uncertain, and complex in which the objective function or constraints can be changed over time. Consequently, the optimum of these issues is changed nonlinearly. Therefore, the optimization algorithms not only should search the global optimum value in the space but also should follow the path of optimal change in dynamic environmen...
متن کاملOn the performance of a hybrid genetic algorithm in dynamic environments
The ability to track the optimum of dynamic environments is important in many practical applications. In this paper, the capability of a hybrid genetic algorithm (HGA) to track the optimum in some dynamic environments is investigated for different functional dimensions, update frequencies, and displacement strengths in different types of dynamic environments. Experimental results are reported b...
متن کاملNovel Radial Basis Function Neural Networks based on Probabilistic Evolutionary and Gaussian Mixture Model for Satellites Optimum Selection
In this study, two novel learning algorithms have been applied on Radial Basis Function Neural Network (RBFNN) to approximate the functions with high non-linear order. The Probabilistic Evolutionary (PE) and Gaussian Mixture Model (GMM) techniques are proposed to significantly minimize the error functions. The main idea is concerning the various strategies to optimize the procedure of Gradient ...
متن کاملOPTIMIZATION OF STEEL MOMENT FRAME BY A PROPOSED EVOLUTIONARY ALGORITHM
This paper presents an improved multi-objective evolutionary algorithm (IMOEA) for the design of planar steel frames. By considering constraints as a new objective function, single objective optimization problems turned to multi objective optimization problems. To increase efficiency of IMOEA different Crossover and Mutation are employed. Also to avoid local optima dynamic interference of mutat...
متن کاملAn Adaptive Multi-Swarm Optimizer for Dynamic Optimization Problems
The multipopulation method has been widely used to solve dynamic optimization problems (DOPs) with the aim of maintaining multiple populations on different peaks to locate and track multiple changing optima simultaneously. However, to make this approach effective for solving DOPs, two challenging issues need to be addressed. They are how to adapt the number of populations to changes and how to ...
متن کامل